Efficient continuous-time dynamic network flow algorithms
نویسندگان
چکیده
منابع مشابه
Efficient continuous-time dynamic network flow algorithms
We extend the discrete-time dynamic ow algorithms presented in the literature to solve the analogous continuous-time dynamic ow problems. These problems include nding maximum dynamic ows, quickest ows, universally maximum dynamic ows, lexicographically maximum dynamic ows, dynamic transshipments, and quickest transshipments in networks with capacities and transit times on the edges.
متن کاملContinuous-Time Dynamic Shortest Path Algorithms
We consider the problem of computing shortest paths through a dynamic network – a network with time-varying characteristics, such as arc travel times and costs, which are known for all values of time. Many types of networks, most notably transportation networks, exhibit such predictable dynamic behavior over the course of time. Dynamic shortest path problems are currently solved in practice by ...
متن کاملLinear-Time FPT Algorithms via Network Flow
In the area of parameterized complexity, to cope with NP-Hard problems, we introduce a parameter k besides the input size n, and we aim to design algorithms (called FPT algorithms) that run in O(f(k)n) time for some function f(k) and constant d. Though FPT algorithms have been successfully designed for many problems, typically they are not sufficiently fast because of huge f(k) and d. In this p...
متن کاملAlgorithms for Discrete and Continuous Multicommodity Flow Network Interdiction Problems
We consider a network interdiction problem on a multicommodity flow network, in which an attacker disables a set of network arcs in order to minimize the maximum profit that can be obtained from shipping commodities across the network. The attacker is assumed to have some budget for destroying (or “interdicting”) arcs, and each arc is associated with a positive interdiction expense. In this pap...
متن کاملGate-efficient discrete simulations of continuous-time quantum query algorithms
We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number of gates between queries. By small overhead, we mean T within a factor that is polylogarithmic in terms of T and a cost measure that reflects the cost of co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 1998
ISSN: 0167-6377
DOI: 10.1016/s0167-6377(98)00037-6